Combining Petri Nets and PA-Processes

نویسنده

  • Richard Mayr
چکیده

Petri nets and PA-processes are incomparable models of inn-nite state concurrent systems. We deene a new model PAN (= PA + PN) that subsumes both of them and is thus strictly more expressive than Petri nets. It extends Petri nets with the possibility to call subroutines. We show that the reachability problem is still decidable for PAN. It is even decidable, if there is a reachable state that satisses certain properties that can be encoded in a simple logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Petri nets are less expressive than state-extended PA

We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit.

متن کامل

Processes of Contextual Nets and their Characteristics

Generalized Place/Transition Petri nets, called contextual nets, and processes of such nets are considered. Processes of contextual nets are represented as partial orders with some extra structure. Operations of composing processes are deened such that each process of a contextual net can be obtained by combining processes corresponding to places and transitions of this net. Matrix-like charact...

متن کامل

Constrained Properties, Semilinear Systems, and Petri Nets

We investigate the veriication problem of two classes of innnite state systems w.r.t. nonregular properties (i.e., nondeenable by nite-state !-automata). The systems we consider are Petri nets as well as semilinear systems including push-down systems and PA processes. On the other hand, we consider properties ex-pressible in the logic CLTL which is an extension of the linear-time temporal logic...

متن کامل

Pragmatics Annotated Coloured Petri Nets for Protocol Software Generation and Verification

PetriCode is a tool that supports automated generation of protocol software from a restricted class of Coloured Petri Nets (CPNs) called Pragmatics Annotated Coloured Petri Nets (PA-CPNs). PetriCode and PA-CPNs have been designed with five main requirements in mind, which include the same model being used for verification and code generation. The PetriCode approach has been discussed and evalua...

متن کامل

Soccer Goalkeeper Task Modeling and Analysis by Petri Nets

In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997